Probabilistic communicating processes
نویسندگان
چکیده
منابع مشابه
Probabilistic Communicating Processes
We explore the suitability of two semantic spaces as a basis for a probabilistic variant of the language of Communicating Sequential Processes (UP), so as to provide a formalism for the specification and proof of correctness of probabilistic algorithms. The two spaces give rise to two sublanguages, each of which is characterised by an algebraic axiomatisation which is shown to be sound and comp...
متن کاملSemantics of Communicating Processes
The semantics of a simple language for describing tightly coupled "synchronous" systems is defined. An operational semantics is given by term rewriting rules and a consistent fully abstract denotational semantics is defined based on the concept of observable behavior and advanced fixed point theory. Particular properties of the language are analysed and especially algebraic laws of the language...
متن کاملReversible Communicating Processes
Reversible distributed programs have the ability to abort unproductive computation paths and backtrack, while unwinding communication that occurred in the aborted paths. While it is natural to assume that reversibility implies full state recovery (as with traditional roll-back recovery protocols), an interesting alternative is to separate backtracking from local state recovery. For example, suc...
متن کاملCommunicating Concurrent Processes
Process algebra CSP only permits a process to engage in one event on a moment and records this single event into the traces of the process. CSP cannot process events simultaneously, it treat the events occurred simultaneously as one single event. We modify CSP to process the events occurred simultaneously, which is called communicating concurrent processes (CCP).
متن کاملCommunicating Mobile Processes
This paper presents a new model for mobile processes in occam-π. A process, embedded anywhere in a dynamically evolving network, may suspend itself mid-execution, be safely disconnected from its local environment, moved (by communication along a channel), reconnected to a new environment and reactivated. Upon reactivation, the process resumes execution from the same state (i.e. data values and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00286-0